Packing Index of Subsets in Polish Groups
نویسندگان
چکیده
For a subset A of a Polish group G, we study the (almost) packing index indP (A) (resp. IndP (A)) of A, equal to the supremum of cardinalities |S| of subsets S ⊂ G such that the family of shifts {xA}x∈S is (almost) disjoint (in the sense that |xA ∩ yA| < |A| for any distinct points x, y ∈ S). Subsets A ⊂ G with small (almost) packing index are small in a geometric sense. We show that indP (A) ∈ N ∪ {א0, c} for any σ-compact subset A of a Polish group. If A ⊂ G is Borel, then the packing indices indP (A) and IndP (A) cannot take values in the half-interval [sq(Π 1 ), c) where sq(Π 1 ) is a certain uncountable cardinal that is smaller than c in some models of ZFC. In each non-discrete Polish Abelian group G we construct two closed subsets A,B ⊂ G with indP (A) = indP (B) = c and IndP (A ∪ B) = 1 and then apply this result to show that G contains a nowhere dense Haar null subset C ⊂ G with indP (C) = IndP (C) = κ for any given cardinal number κ ∈ [4, c].
منابع مشابه
Grey Subsets of Polish Spaces
We develop the basics of an analogue of descriptive set theory for functions on a Polish space X. We use this to define a version of the small index property in the context of Polish topometric groups, and show that Polish topometric groups with ample generics have this property. We also extend classical theorems of Effros and Hausdorff to the topometric context.
متن کاملPacking Designs with Block Size 5 and Index 2: The Case v Even
An (v, •, 2) packing design of order v, block size ~, and index 2 is a collection of ~:-element subsets, called blocks, of a set V such that every 2-subsets of V occurs in at most 2 blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we provide a powerful technique for constructing designs and solve the packing problem in the case tc = 5, ...
متن کاملA relation between infinite subsets and exterior center in groups
Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1 if and only if the exterior center of G ihas finit...
متن کاملCounting Packings of Generic Subsets in Finite Groups
A packing of subsets S1, . . . ,Sn in a group G is an element (g1, . . . , gn) of Gn such that g1S1, . . . , gnSn are disjoint subsets of G. We give a formula for the number of packings if the group G is finite and if the subsets S1, . . . ,Sn satisfy a genericity condition. This formula can be seen as a generalization of the falling factorials which encode the number of packings in the case wh...
متن کاملبررسی اثر پالیش بر روی استحکام Flexural پرسلن فلدسپاتیک و مقایسه آن با اتوگلیز و اورگلیز
Statement of Problem: Ceramic restorations are popular because they can provide the most natural replacement for teeth. However, the brittleness of ceramics is a primary disadvantage. There are various methods for strengthening ceramics such as metal framework, ceramic cores, and surface strengthening mechanisms through glazing, work hardening and ion exchange. Purpose: The purpose of this stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 50 شماره
صفحات -
تاریخ انتشار 2009